Determination of Set-Membership Identifiability Sets

This paper concerns the concept of set-membership identifiability introduced in [4]. Given a model, a set-membership identifiable set is a connected set in the parameter domain of the model such that its corresponding trajectories are distinct to trajectories arising from its complementary. For obtaining the so-called set-membership identifiable sets, we propose an algorithm based on interval analysis tools. The proposed algorithm is decomposed into three parts namely mincing, evaluating and regularization ([6]). The latter step has been modified in order to obtain guaranteed set-membership identifiable sets. Our algorithm will be tested on two examples.